A Message-Passing Algorithm for Wireless Network Scheduling
نویسندگان
چکیده
منابع مشابه
Network scheduling and message-passing
Algorithms are operational building-blocks of a network. An important class of network algorithms deal with the scheduling of common resources among various entities such as packets or flows. In a generic setup, such algorithms operate under stringent hardware, time, power or energy constraints. Therefore, algorithms have to be extremely simple, lightweight in data-structure and distributed. Th...
متن کاملA Message-Passing Algorithm for Graph Isomorphism
A message-passing procedure for solving the graph isomorphism problem is proposed. The procedure resembles the belief-propagation algorithm in the context of graphical models inference and LDPC decoding. To enable the algorithm, the input graphs are transformed into intermediate canonical representations of bipartite graphs. The matching procedure injects specially designed input patterns to th...
متن کاملA Message Passing Algorithm for Plan Recognition
We present a general framework for plan recognit ion whose formulation is motivated by a general purpose algorithm for effective abduction. The knowledge representation is a restricted form of first order logic, which is made computationally explicit as a graph structure in which plans are manifest as a special kind of graph walk. Intuitively, plans are fabricated by searching an action descrip...
متن کاملA Message Passing Algorithm for MAX2SAT
We propose a simple and deterministic algorithm for solving MAX2SAT, which runs O(n(n+m)) time where n and m are respectively the number of variables and clauses. For discussing its average case performance, we propose one natural “planted solution model”; a way to generate a MAX2SAT instance under a certain distribution defined by parameters p and r. We first show that if p = Ω(ln n/n) and p ≥...
متن کاملEntropy Message Passing Algorithm
Message passing over factor graph can be considered as generalization of many well known algorithms for efficient marginalization of multivariate function. A specific instance of the algorithm is obtained by choosing an appropriate commutative semiring for the range of the function to be marginalized. Some examples are Viterbi algorithm, obtained on max-product semiring and forward-backward alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2015
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2014.2338277